A Maximum Expected Covering Location Model: Formulation, Properties and Heuristic Solution
نویسندگان
چکیده
منابع مشابه
A multiobjective continuous covering location model
This paper presents a multiobjective continuous covering location problem in fuzzy environment. Because of uncertain covering radius, possibility of covering concept is introduced.Since, the uncertainty may cause risk of uncovering customers; the problemis formulated as a risk management model. The presented model is an extension of the discrete covering location models tocontinuous space. Two ...
متن کاملA New Heuristic Solution Method for Maximal Covering Location-Allocation Problem with M/M/1 Queueing System
We consider the queueing maximal covering location-allocation problem (QM-CLAP) with an M/M/1 queueing system. We propose a new solution procedure based on decomposition of the problem into smaller sub-problems. We solve the resulting sub-problems both with a branch and bound algorithm and with the meta-heuristic GRASP. We also solve the entire model with GRASP. Computational results for these ...
متن کاملAn Inventory-Location Model: Formulation, Solution Algorithm and Computational Results
We introduce a distribution center (DC) location model that incorporates working inventory and safety stock inventory costs at the distribution centers. In addition, the model incorporates transport costs from the suppliers to the DCs that explicitly reflect economies of scale through the use of a fixed cost term. The model is formulated as a non-linear integer-programming problem. Model proper...
متن کاملA Decomposition Heuristic for the Maximal Covering Location Problem
This paper proposes a cluster partitioning technique to calculate improved upper bounds to the optimal solution of maximal covering location problems. Given a covering distance, a graph is built considering as vertices the potential facility locations, and with an edge connecting each pair of facilities that attend a same client. Coupling constraints, corresponding to some edges of this graph, ...
متن کاملa new heuristic solution method for maximal covering location-allocation problem with m/m/1 queueing system
we consider the queueing maximal covering location-allocation problem (qm-clap) with an m/m/1 queueing system. we propose a new solution procedure based on decomposition of the problem into smaller sub-problems. we solve the resulting sub-problems both with a branch and bound algorithm and with the meta-heuristic grasp. we also solve the entire model with grasp. computational results for these ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transportation Science
سال: 1983
ISSN: 0041-1655,1526-5447
DOI: 10.1287/trsc.17.1.48